Balancedness of Arnoux-Rauzy and Brun Words
نویسندگان
چکیده
We study balancedness properties of words given by the Arnoux-Rauzy and Brun multi-dimensional continued fraction algorithms. We show that almost all Brun words on 3 letters and Arnoux-Rauzy words over arbitrary alphabets are finitely balanced; in particular, boundedness of the strong partial quotients implies balancedness. On the other hand, we provide examples of unbalanced Brun words on 3 letters.
منابع مشابه
Balance properties of Arnoux-Rauzy words
The paper deals with balances and imbalances in Arnoux-Rauzy words. We provide sufficient conditions for C-balancedness, but our results indicate that even a characterization of 2-balanced Arnoux-Rauzy words on a 3-letter alphabet is not immediate.
متن کاملGeometry, Dynamics, and Arithmetic of S-adic Shifts
This paper studies geometric and spectral properties of S-adic shifts and their relation to continued fraction algorithms. Pure discrete spectrum for S-adic shifts and tiling properties of associated Rauzy fractals are established under a generalized Pisot assumption together with a geometric coincidence condition. These general results extend the scope of the Pisot substitution conjecture to t...
متن کاملA Generalization of Sturmian Sequences; Combinatorial Structure and Transcendence∗
In this paper we study dynamical properties of a class of uniformly recurrent sequences on a k-letter alphabet with complexity p(n) = (k − 1)n + 1. These sequences, originally defined by P. Arnoux and G. Rauzy, are a natural generalization of the (binary) Sturmian sequences of Morse and Hedlund. We give two combinatorial algorithms for constructing characteristic Arnoux-Rauzy sequences. The fir...
متن کاملFactor Complexity of S-adic sequences generated by the Arnoux-Rauzy-Poincaré Algorithm
The Arnoux-Rauzy-Poincaré multidimensional continued fraction algorithm is obtained by combining the Arnoux-Rauzy and Poincaré algorithms. It is a generalized Euclidean algorithm. Its three-dimensional linear version consists in subtracting the sum of the two smallest entries to the largest if possible (Arnoux-Rauzy step), and otherwise, in subtracting the smallest entry to the median and the m...
متن کامل2 00 7 Return Words in Fixed Points of Substitutions
We present three simple ideas which enable to determine easily the number of return words in some infinite words. Using these ideas, we give a new and very short proof of the fact that each factor of an Arnoux-Rauzy word of order m has exactly m return words. We describe the structure of return words for the Thue-Morse sequence and focus on infinite words which are associated to simple Parry nu...
متن کامل